Distributionally Robust Frequency Constrained Scheduling for an Integrated Electricity-Gas System
نویسندگان
چکیده
Power systems are shifted from conventional bulk generation toward renewable generation. This trend leads to the frequency security problem due decline of system inertia. On other hand, natural gas-fired units frequently scheduled provide operational flexibility their fast adjustment ability. The interdependence between power and gas is thus intensified. In this context, paper considers constrained scheduling perspective an integrated electricity-gas under wind uncertainty. A distributionally robust (DR) joint chance-constrained optimization model proposed co-optimize unit commitment virtual inertia provision farm systems. incorporates both constraints (NGS) addresses uncertainty by designing DR chance constraints. It shown that admits a mixed-integer second-order cone programming. Case studies demonstrate method can highly reliable computationally efficient solution show importance incorporating NGS in problem.
منابع مشابه
Distributionally robust chance-constrained linear programs
In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that for a wide class of probability distributions (i.e. radial distributions) on the data, the probability constraints can be explicitly converted into convex second...
متن کاملKullback-Leibler Divergence Constrained Distributionally Robust Optimization
In this paper we study distributionally robust optimization (DRO) problems where the ambiguity set of the probability distribution is defined by the Kullback-Leibler (KL) divergence. We consider DRO problems where the ambiguity is in the objective function, which takes a form of an expectation, and show that the resulted minimax DRO problems can be formulated as a one-layer convex minimization ...
متن کاملDistributionally Robust Chance-Constrained Bin Packing
Chance-constrained bin packing problem allocates a set of items into bins and, for each bin, bounds the probability that the total weight of packed items exceeds the bin’s capacity. Different from the stochastic programming approaches relying on full distributional information of the random item weights, we assume that only the information of the mean and covariance matrix is available. Accordi...
متن کاملOn distributionally robust joint chance-constrained problems
Introduction: A chance constrained optimization problem involves constraints with stochastic data that are required to be satisfied with a pre-specified probability. When the underlying distribution of the stochastic data is not known precisely, an often used model is to require the chance constraints to hold for all distributions in a given family. Such a problem is known as a distributionally...
متن کاملOn Distributionally Robust Chance-Constrained Linear Programs1
In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that, for a wide class of probability distributions (namely, radial distributions) on the data, the probability constraints can be converted explicitly into convex se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Smart Grid
سال: 2022
ISSN: ['1949-3053', '1949-3061']
DOI: https://doi.org/10.1109/tsg.2022.3158942